-
1 analytical definability
Большой англо-русский и русско-английский словарь > analytical definability
-
2 analytical definability
Математика: аналитическая определимостьУниверсальный англо-русский словарь > analytical definability
-
3 analytical definability
English-Russian scientific dictionary > analytical definability
-
4 definability
combinatorial [combinatory] definability — комбинаторная определимость
-
5 аналитическая определимость
Большой англо-русский и русско-английский словарь > аналитическая определимость
-
6 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
-
7 piecewise
1) кусочный
2) кусочно
3) кусочно-линейный ∙ piecewise [sectionally] smooth ≈ кусочно гладкий piecewise analytic differential ≈ кусочно аналитический дифференциал piecewise analytic function ≈ кусочно аналитическая функция piecewise constant function ≈ кусочно постоянная функция;
ступенчатая функция piecewise continuous curve ≈ кусочно непрерывная кривая piecewise continuous derivative ≈ кусочно непрерывная производная piecewise continuous function ≈ кусочно непрерывная функция piecewise continuously differentiable function ≈ кусочно гладкая функция piecewise differentiable curve ≈ кусочно дифференцируемая кривая piecewise expanding function ≈ кусочно расширяющаяся функция piecewise linear characteristic ≈ кусочно-линейная характеристика piecewise linear form ≈ кусочно-линейная форма piecewise linear function ≈ кусочно линейная функция piecewise linear function generator ≈ генератор кусочно-линейной функции piecewise linear machine ≈ кусочно-линейная машина piecewise monotonic function ≈ кусочно монотонная функция piecewise polynomial function ≈ кусочно полиномиальная функция, сплайн piecewise quadratic function ≈ кусочно квадратичная функция piecewise rectifiable curve ≈ кусочно спрямляемая кривая piecewise recursive set ≈ кусочно рекурсивное множество piecewise regular function ≈ кусочно регулярная функция piecewise smooth curve ≈ кусочно гладкая кривая piecewise smooth function ≈ кусочно гладкая функция - piecewise affine - piecewise analytical - piecewise characteristic - piecewise conformal - piecewise constant - piecewise continuity - piecewise continuous - piecewise definability - piecewise definable - piecewise differentiability - piecewise differentiable - piecewise harmonic - piecewise holomorphic - piecewise linear - piecewise linearity - piecewise linearization - piecewise polynomial - piecewise quadratic - piecewise rectilineal - piecewise recursive - piecewise regression - piecewise regular - piecewise smooth КусочноБольшой англо-русский и русско-английский словарь > piecewise
-
8 lemma
См. также в других словарях:
Definable real number — A real number a is first order definable in the language of set theory, without parameters, if there is a formula φ in the language of set theory, with one free variable, such that a is the unique real number such that φ(a) holds in the standard… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Pointclass — In the mathematical field of descriptive set theory, a pointclass is a collection of sets of points, where a point is ordinarily understood to be an element of some perfect Polish space. In practice, a pointclass is usually characterized by some… … Wikipedia
Hyperarithmetical theory — In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an… … Wikipedia
List of philosophy topics (A-C) — 110th century philosophy 11th century philosophy 12th century philosophy 13th century philosophy 14th century philosophy 15th century philosophy 16th century philosophy 17th century philosophy 18th century philosophy 19th century philosophy220th… … Wikipedia
List of computability and complexity topics — This is a list of computability and complexity topics, by Wikipedia page. Computability theory is the part of the theory of computation that deals with what can be computed, in principle. Computational complexity theory deals with how hard… … Wikipedia
logic, philosophy of — Philosophical study of the nature and scope of logic. Examples of questions raised in the philosophy of logic are: In virtue of what features of reality are the laws of logic true? ; How do we know the truths of logic? ; and Could the laws of… … Universalium
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Wadge hierarchy — In descriptive set theory, Wadge degrees are levels of complexity for sets of reals and more comprehensively, subsets of any given topological space. Sets are compared by continuous reductions. The Wadge hierarchy is the structure of Wadge… … Wikipedia
Definable set — In mathematical logic, a definable set is an n ary relation on the domain of a structure whose elements are precisely those elements satisfying some formula in the language of that structure. A set can be defined with or without parameters, which … Wikipedia